On the endomorphism monoid of a profinite semigroup

On graphs with a given endomorphism monoid

The Endomorphism Monoid of N-Prism

In this paper, the endomorphism monoid of n-prism Pr(n) is explored explicitly. It is shown that Pr(2m + 1) is endomorphism regular for any m ≥ 1 and Pr(2m) is not endomorphism regular for any m ≥ 2. Mathematics Subject Classification: 05C25, 20M20

On Recovering a Bounded Distributive Lattice from Its Endomorphism Monoid

The sub algebra functor Sub A is faithful for Boolean algebras (Sub A •Sub B implies A • B, see D. Sachs [7] ), but it is not faithful for bounded distributive lattices or unbounded distributive lattices. The automorphism functor Aut A is highly unfaithful even for Boolean algebras. The endomorphism functor End A is the most faithful of all three. B. M. Schein [8] and K. D.' Magill [5] establis...

Profinite Methods in Semigroup Theory

A highlight of the Conference held at the University of Nebraska-Lincoln in May 2000 was the proof of the decidability of the complexity of nite semigroups and automata, presented by Rhodes 78]. This problem had been open for more than thirty years and had inspired many active branches of semigroup theory. As is usually the case with old and diicult problems, the solution for the original quest...

Monoid Kernels and Profinite Topologies on the Free Abelian Group

To each pseudovariety of abelian groups residually containing the integers, there is naturally associated a proonite topology on any nite rank free abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can eeectively compute membership in the closure of a subgroup and more generally, in the closure of a rational subset of such a ...